Multiple-Valued Programmable Logic Arrays with Universal Literals

A universal literal is a single-variable function and has an ability to manipulate more information than a set lateral. The array size therefore could be eliminated b y using universal literal generators (ULGs for short) in programmable logic arrays (PLAs), compared to PLAs with set literals. This paper discusses what operator is the most suitable in the term of eliminating the array size. We find four solutions as the good operator structures t o eliminate the array size. A speculation of the upper bound of the array sizes is shown. Experiments are also done for randomly generated functions and some arithmetic functions. The experimental results show that the MAX-of-TPRODUCT form PLAs require the smallest array size.